An Infeasibility Result for the Multiterminal Source-Coding Problem
نویسندگان
چکیده
We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the “CEO problem.” The bound recovers many of the converse results that have been established for special cases of the problem, including the recent one for the Gaussian version of the CEO problem.
منابع مشابه
ar X iv : c s . IT / 0 51 11 03 v 1 3 0 N ov 2 00 5 An Infeasibility Result for the Multiterminal Source - Coding Problem ∗
We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the “CEO problem.” The bound recovers many of the converse results that have been establishe...
متن کاملDistributed Source Coding of Correlated Gaussian Sources
We consider the distributed source coding system of L correlated Gaussian sources Yl, l = 1, 2, · · · , L which are noisy observations of correlated Gaussian remote sources Xk, k = 1, 2, · · · ,K. We assume that Y L = (Y1, Y2, · · · , YL) is an observation of the source vector X = (X1, X2, · · · , XK), having the form Y L = AX+N, where A is a L×K matrix and N = (N1, N2, · · · , NL) is a vector ...
متن کاملAn Information-Spectrum Approach to Multiterminal Rate-Distortion Theory
An information-spectrum approach is applied to solve the multiterminal source coding problem for correlated general sources, where sources may be nonstationary and/or nonergodic, and the distortion measure is arbitrary and may be nonadditive. A general formula for the rate-distortion region of the multiterminal source coding problem with the maximum distortion criterion under fixed-length codin...
متن کاملThe Region of Achievable Rates for Multiterminal Source Coding–Part I
It is proved that a convexified form of the Berger-Tung inner bound provides the set of all achievable rates for the multiterminal source coding problem. In this paper, a proof is developed for general discrete memoryless sources and bounded distortion measures, for two encoding terminals. The proof is based on two new developments. One is the construction of new inner and outer bounds to the r...
متن کاملMultiterminal Source-Channel Communication Under Orthogonal Multiple Access
We consider the problem of multiterminal source-channel communication where a number of distributed and possibly correlated sources are transmitted through an orthogonal multiple access channel to a common destination. We characterize the optimal tradeoff between the transmission cost Γ and the distortion vector D as measured against individual sources. Our approach consists of two steps: (1) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0511103 شماره
صفحات -
تاریخ انتشار 2005